Terrorist Targeting, Information, and Secret Coalitions
نویسندگان
چکیده
We consider a game played by a state sponsor of terrorism, a terrorist group, and the target of terrorist attacks. The sponsoring state wishes to see as much damage inflicted on the target of attack as possible, but wishes to avoid retaliation. To do so, his relationship with the terrorist group must remain ambiguous. The target of attack, for his part, wishes to bring these attacks to an end as quickly as possible and will consider the option of retaliating against the sponsor to do so. There is a penalty, however, for retaliating against a state that is not supporting terrorist operations, and even if the victim is aware of this relationship, it is necessary to convince third parties that this relationship actually exists. We approach the problem by introducing an “evidence” variable in a dynamic setting. We show that the interplay of different strategic and non-strategic effects boils down to three qualitatively different scenarios, determined by key parameters. Based on this result, two alternative instruments to retaliation are identified in order to resist terrorist activities. First, assuming that the target is able to change some parameters by monetary investments, the paper provides an economic analysis of how to invest optimally in order to make the sponsor lose incentives to support the terrorist group. Second, we propose changing the structure of the game. Here, the key insight is that the target country can make a unilateral statement as to his strategy. The sponsor cannot do so as he is in fact claiming that there is no cooperation with terrorist groups. While our discussion, in this article, is motivated by an important problem in contemporary counterterrorism policy, it applies more generally to the study of secret coalitions.
منابع مشابه
An ideal multi-secret sharing scheme based on minimal privileged coalitions
How to construct an ideal multi-secret sharing scheme for general access structures is difficult. In this paper, we solve an open problem proposed by Spiez et al.recently [Finite Fields and Their Application, 2011(17) 329-342], namely to design an algorithm of privileged coalitions of any length if such coalitions exist. Furthermore, in terms of privileged coalitions, we show that most of the e...
متن کاملVssdb: A Verifiable Secret-Sharing Distance-Bounding Protocol
Terrorist fraud is a class of relay attacks against distancebounding (DB) protocols in which a distant malicious prover colludes with an attacker located in a verifier’s proximity when authenticating. Existing DB protocols resisting such attacks are designed to be lightweight and thus symmetric, relying on a secret shared by the prover and the verifier. Recently, several asymmetric distance-bou...
متن کاملRational Secret Sharing over an Asynchronous Broadcast Channel with Information Theoretic Security
We consider the problem of rational secret sharing introduced by Halpern and Teague [1], where the players involved in secret sharing play only if it is to their advantage. This can be characterized in the form of preferences. Players would prefer to get the secret than to not get it and secondly with lesser preference, they would like as few other players to get the secret as possible. Several...
متن کاملThreshold Cryptography with Chinese Remainder Theorem a Dissertation Submitted to the Department of Computer Engineering and the Institute of Engineering and Science of Bi̇lkent University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
THRESHOLD CRYPTOGRAPHY WITH CHINESE REMAINDER THEOREM Kamer Kaya Ph.D. in Computer Engineering Supervisor: Asst. Prof. Dr. Ali Aydın Selçuk August, 2009 Information security has become much more important since electronic communication is started to be used in our daily life. The content of the term information security varies according to the type and the requirements of the area. However, no ...
متن کاملA New family of Ideal Multipartite Access Structure Based on MSP
Secret sharing schemes are methods designed to share a secret among a group of participants in such a way that the secret can be reconstruct only by specified groups of participant, if non-allowed coalitions cannot obtain any information about the secret. Then the scheme is said to be perfect. Let P = {p1, p2, . . . , pn} be the set of players. The family of qualified subsets Γ ⊆ 2 is called th...
متن کامل